Convex Cone Conditions on the Structure of Designs
نویسنده
چکیده
Various known and original inequalities concerning the structure of combinatorial designs are established using polyhedral cones generated by incidence matrices. This work begins by giving definitions and elementary facts concerning t-designs. A connection with the incidence matrix W of t-subsets versus k-subsets of a finite set is mentioned. The opening chapter also discusses relevant facts about convex geometry (in particular, the Farkas Lemma) and presents an arsenal of binomial identities. The purpose of Chapter 2 is to study the cone generated by columns of W , viewed as an increasing union of cones with certain invariant automorphisms. The two subsequent chapters derive inequalities on block density and intersection patterns in t-designs. Chapter 5 outlines generalizations of W which correspond to hypergraph designs and poset designs. To conclude, an easy consequence of this theory for orthogonal arrays is used in a computing application which generalizes the method of two-point based sampling.
منابع مشابه
Gyrovector Spaces on the Open Convex Cone of Positive Definite Matrices
In this article we review an algebraic definition of the gyrogroup and a simplified version of the gyrovector space with two fundamental examples on the open ball of finite-dimensional Euclidean spaces, which are the Einstein and M"{o}bius gyrovector spaces. We introduce the structure of gyrovector space and the gyroline on the open convex cone of positive definite matrices and explore its...
متن کاملOptimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone
In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
متن کاملGlobal convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملOn Polar Cones and Differentiability in Reflexive Banach Spaces
Let $X$ be a Banach space, $Csubset X$ be a closed convex set included in a well-based cone $K$, and also let $sigma_C$ be the support function which is defined on $C$. In this note, we first study the existence of a bounded base for the cone $K$, then using the obtained results, we find some geometric conditions for the set $C$, so that ${mathop{rm int}}(mathrm{dom} sigma_C) neqem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003